The importance of computing intermodal roundtrips in multimodal guidance systems Daniel Baumann, EPFL - LAVOC Alexandre Torday, EPFL - LAVOC Prof. André-Gilles Dumont, EPFL - LAVOC

Source URL: www.strc.ch

• Edsger W. Dijkstra
• Logistics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Shortest path problem
• Intermodal freight transport
• Transport
• Multimodal transport
• Program optimization
• Intermodal journey planner
• Journey planner

2014 ASE BIGDATA/SOCIALCOM/CYBERSECURITY Conference, Stanford University, May 27-31, 2014 Real Time Closeness and Betweenness Centrality Calculations on Streaming Network Data Wei Wei

Source URL: www.casos.cs.cmu.edu

• Network theory
• Mathematics
• Graph theory
• Discrete mathematics
• Network analysis
• Networks
• Social networks
• Centrality
• Betweenness centrality
• Social network analysis
• Closeness centrality
• Shortest path problem

Robust Optimization with Recovery: Application to Shortest Paths and Airline Scheduling Niklaus Eggenberg, Transport and Mobility Laboratory, EPFL Matteo Salani, Transport and Mobility Laboratory, EPFL Michel Bierlaire,

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Mathematics
• Mathematical analysis
• Shortest path problem
• Robust optimization
• Linear programming
• Stochastic optimization
• SAMPL
• Global optimization
• Scenario optimization

Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Routing algorithms
• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming
• Edge disjoint shortest pair algorithm
• K shortest path routing

6.889 — Lecture 11: Multiple-Source Shortest Paths Christian Sommer (figures by Philip Klein) October 19, 2011 Single-Source Shortest Path (SSSP) Problem: given a graph G = (V, E) and a source vertex s ∈

Source URL: courses.csail.mit.edu

Approximating Equilibrium Conditions with Macroscopic Fundamental Diagrams Mehmet Yildirimoglu Nikolas Geroliminis STRC 2014

Source URL: www.strc.ch

• Transport
• Land transport
• Road transport
• Transportation planning
• Road traffic management
• Route assignment
• Fundamental diagram of traffic flow
• Traffic flow
• John Glen Wardrop
• Shortest path problem
• Routing
• Traffic congestion

Start Destination The Landmark Spider: Weaving the Landmark Web

Source URL: www.strc.ch

• Routing algorithms
• Mathematics
• Edsger W. Dijkstra
• Network theory
• Game artificial intelligence
• Graph theory
• Geography
• Search algorithms
• Wayfinding
• A* search algorithm
• Shortest path problem
• Landmark

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Graph traversal
• Shortest path problem
• A* search algorithm
• Directed graph
• Matching
• Connectivity

Start: Haugesund, Rogaland, Norway End: Trondheim, Sør-Trøndelag, Norway Total Distance: Miles Estimated Total Time: 47 hours, 31 minutes Source: http://www.mappoint.msn.com (Jan 31, 2005)

Source URL: www.strc.ch

• Statistical models
• Choice modelling
• Single-equation methods
• Regression analysis
• Discrete choice
• Mixed logit
• Multinomial logistic regression
• Shortest path problem
• Logit
• Probit
• Logistic regression
• Pairwise comparison

Route Choice: Models and Challenges Shlomo Bekhor Technion – Israel Institute of Technology Swiss Transport Research Conference

Source URL: www.strc.ch

• Metaphysics
• Network theory
• Philosophy
• Operations research
• Edsger W. Dijkstra
• Shortest path problem
• Simulation
• Transportation planning
• Choice modelling
• Choice
• Route choice
• Mathematics